Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

Binary tree array representation

There are two ways of representing a binary tree. The first is using a dynamic representation using pointers (node representation) as we did in the previous chapter. The second is using an array accessing the correct indexes to retrieve the values of the parent, left, and right children. The following diagram demonstrates the binary tree's different representations:

To access the nodes of a binary tree using a regular array, we can manipulate the index with the following behavior:

For any given node at posi­tion index:

  • Its left child is located at 2 * index + 1 (if available)
  • Its right child is located at ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content