0
1.7kviews
Discuss AVL Trees.
1 Answer
0
12views
  • A binary tree is a data structure in which every node has no more than two descendent nodes and no more than one parent node.
  • A binary search tree is a binary tree in which a node’s left child node has a value less than its and the node’s right …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.