GATE 2019CSE DATA STRUCTURES Let t be a FULL BINARY TREE with 8 leaves | Expected value of distance

For any queries feel free to comment or direct message on Instagram Instagram -   / jatingupta5jan   Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T(i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places) ___________ . Playlist link - C programming -    • C PROGRAMMING |GATE CS/IT  PYQ | PREVIOUS ...   Time Complexity -    • GATE CS/IT PYQ TIME COMPLEXITY | ALGORITHM...   Data structure -    • GATE CS/IT (PYQ) | DATA STRUCTURES  | NET ...   Algorithms -    • GATE CS/IT (PYQ) ALGORITHMS | TIME COMPLEX...   Binary tree -    • GATE CS/IT CSE PYQ| BINARY TREE | DATA STR...   Linked List -    • GATE CS/IT CSE PYQ | LINKED LIST | DATA ST...