Register

Doubt in ordered tree and binary tree.

763 views

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · What's wrong with th...Next → · the gate book
← Previous in category · data structureNext in category → · the gate book
Position:
Show:

Related questions

1 1 vote
1 1 answer
3.6k
3.6k views
arya_stark asked Jul 4, 2018
3,647 views
Entriies in s stack are "ordered".
Entries in a stack are "ordered". What is the meaning of this statement?
1 1 vote
0 0 answers
1.5k
1.5k views
Rohit Gupta 8 asked Dec 25, 2017
1,456 views
If the average depth of a node in an n-node binary search tree is O(lg n), then the height of the tree is
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
2 2 votes
1 answers 1 answer
14.9k
14.9k views
vijaycs asked May 25, 2016
14,891 views
Minimum number of nodes in a full binary tree with height 3?
0 0 votes
1 1 answer
1.2k
1.2k views
tamil93 asked Feb 3, 2016
1,180 views
Maximum number of nodes in binary tree