A one-to-one correspondence between two classes of ordered trees (Q1123634): Difference between revisions

@@ Property / cites work @@
+A note on plane trees
@@ Property / cites work: A note on plane trees / rank @@
+Normal rank
@@ Property / cites work @@
+The number of registers required for evaluating arithmetic expressions
+Normal rank
@@ Property / cites work @@
+Q3339285
@@ Property / cites work: Q3339285 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5333061
@@ Property / cites work: Q5333061 / rank @@
+Normal rank
@@ Property / cites work @@
+The average number of registers needed to evaluate a binary tree optimally
+Normal rank
@@ Property / cites work @@
+Q3674071
@@ Property / cites work: Q3674071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3779735
@@ Property / cites work: Q3779735 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of deepest nodes in ordered trees
@@ Property / cites work: On the number of deepest nodes in ordered trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating <i>t</i>-Ary Trees Lexicographically
@@ Property / cites work: Generating <i>t</i>-Ary Trees Lexicographically / rank @@
+Normal rank
@@ Property / cites work @@
+Two short proofs of Kemp's identity for rooted plane trees
+Normal rank