Skip to main content

Timeline for Decide Contiguous Binary Tree

Current License: CC BY-SA 4.0

20 events
when toggle format what by license comment
May 13, 2023 at 8:40 vote accept Dannyu NDos
May 9, 2023 at 6:15 answer added Damian Pavlyshyn timeline score: 1
May 8, 2023 at 22:16 comment added Dannyu NDos @DavidG. You've misunderstood. Leaves are nullptr here.
May 8, 2023 at 22:00 comment added David G. @DannyuNDos But a binary tree can have 2 entries in it. In a binary tree, there is normally an entry in each leaf and each branch node.
May 8, 2023 at 21:33 comment added Dannyu NDos @DavidG. Nodes are branches; leaves don't count as nodes.
May 8, 2023 at 20:21 comment added David G. The test cases do not include any nodes with one child, like: [L,] or [[L,],[L,L]] Note that this could break some parsers based on the existing test cases.
May 7, 2023 at 17:04 answer added Roman Czyborra timeline score: 3
May 5, 2023 at 23:36 answer added Neil timeline score: 5
May 5, 2023 at 22:48 answer added Neil timeline score: 3
May 5, 2023 at 8:52 answer added Kevin Cruijssen timeline score: 5
May 5, 2023 at 8:37 answer added Arnauld timeline score: 5
May 5, 2023 at 8:25 history became hot network question
May 5, 2023 at 3:37 answer added Ajax1234 timeline score: 2
May 5, 2023 at 3:22 history edited Dannyu NDos CC BY-SA 4.0
edited body
May 5, 2023 at 2:30 answer added alephalpha timeline score: 6
May 5, 2023 at 2:14 comment added Dannyu NDos @alephalpha Nodes are branches; leaves don't count as nodes.
May 5, 2023 at 1:25 history edited Dannyu NDos CC BY-SA 4.0
added 19 characters in body
May 5, 2023 at 1:24 comment added Unrelated String Assuming solutions have to handle unbalanced trees, it would help to have one in the falsy test cases.
May 5, 2023 at 0:45 answer added Unrelated String timeline score: 11
May 5, 2023 at 0:21 history asked Dannyu NDos CC BY-SA 4.0